Discrete Tableau Algorithms for FSHI
نویسندگان
چکیده
A variety of fuzzy description logics are proposed to extend classical description logics with fuzzy capability. However, reasoning with general TBoxes is still an open problem in fuzzy description logics. In this paper, we present a novel discrete tableau algorithm for a given fuzzy description logic FSHI with general TBoxes, which tries to construct discrete tableaus of FSHI knowledge bases. We prove the equivalence of existence between discrete tableaus and models of FSHI knowledge bases, hence getting that the discrete tableau algorithm is a sound and complete decision procedure for FSHI reasoning problems with general TBoxes.
منابع مشابه
Tableau algorithms defined naturally for pictures
The following text is an annotation to Marc A. A. van Leeuwen's paper " Tableau algorithms defined naturally for pictures " in its version of 25 November 2011. This annotation contains corrections of a few mistakes. Different comments are separated by horizontal lines, like this: Page 1, §1: Replace " as a tableaux " by " as tableaux ". Page 3, §2.2: Replace " The the non-empty " by " The non-e...
متن کاملReasoning with Fuzzy Ontologies
By the development of Semantic Web, increasing demands for vague information representation have triggered a mass of theoretical and applied researches of fuzzy ontologies, whose main logical infrastructures are fuzzy description logics. However, current tableau algorithms can not supply complete reasoning support within fuzzy ontology: reasoning with general TBox is still a difficult problem i...
متن کاملPERFORMANCE OF DIFFERENT ANT-BASED ALGORITHMS FOR OPTIMIZATION OF MIXED VARIABLE DOMAIN IN CIVIL ENGINEERING DESIGNS
Ant colony optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...
متن کاملA Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses
In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...
متن کاملTableau Systems for SHIO and SHIQ
Two prominent families of algorithms for the satisfiability test of DLs are automatabased algorithms (see e.g. [6]), which translate a concept C into an automaton AC accepting all (abstractions of) models for C, and tableau algorithms (TAs) [2], which incrementally create a tree-shaped (pre-) model for C using a set of completion rules. In short, the advantages of automata algorithms are on the...
متن کامل